New Width Parameters for Model Counting
نویسندگان
چکیده
We study the parameterized complexity of the propositional model counting problem #SAT for CNF formulas. As the parameter we consider the treewidth of the following two graphs associated with CNF formulas: the consensus graph and the conflict graph. Both graphs have as vertices the clauses of the formula; in the consensus graph two clauses are adjacent if they do not contain a complementary pair of literals, while in the conflict graph two clauses are adjacent if they do contain a complementary pair of literals. We show that #SAT is fixed-parameter tractable for the treewidth of the consensus graph but W[1]-hard for the treewidth of the conflict graph. We also compare the new parameters with known parameters under which #SAT is fixed-parameter tractable.
منابع مشابه
Three New Systematic Approaches for Computing Heffron-Phillips Multi-Machine Model Coefficients (RESEARCH NOTE)
This paper presents three new systematic approaches for computing coefficient matrices of the Heffron-Phillips multi-machine model (K1, …, K6). The amount of computations needed for conventional and three new approaches are compared by counting number of multiplications and divisions. The advantages of new approaches are: (1) their computation burdens are less than 73 percent of that of convent...
متن کاملOn the Impact of Juction-Tree Topology on Weighted Model Counting
We present a new measure, CNF-tree-width (CNFtw), for bounding the complexity of weighted model counting and related #P-hard problems. CNF-tw dominates known measures such as the dtree width and the treewidth of the CNF primal and incidence graphs. We present a novel approach that utilizes the junction-tree structure in order to decompose the formula. We also characterize a new class of CNFs wh...
متن کاملModeling the frequency-dependent detective quantum efficiency of photon-counting x-ray detectors.
PURPOSE To find a simple model for the frequency-dependent detective quantum efficiency (DQE) of photon-counting detectors in the low flux limit. METHODS Formula for the spatial cross-talk, the noise power spectrum and the DQE of a photon-counting detector working at a given threshold are derived. Parameters are probabilities for types of events like single counts in the central pixel, double...
متن کاملBetter Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known – e.g. [Fischer, Makowsky, and Ravve] – with a singleexponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (...
متن کاملBounded Depth Arithmetic Circuits: Counting and Closure
Constant-depth arithmetic circuits have been defined and studied in [AAD97, ABL98]; these circuits yield the function classes #AC and GapAC. These function classes in turn provide new characterizations of the computational power of threshold circuits, and provide a link between the circuit classes AC (where many lower bounds are known) and TC (where essentially no lower bounds are known). In th...
متن کامل